The Spectrum of Small DeMorgan Formulas

نویسندگان

  • Anat Ganor
  • Ilan Komargodski
  • Ran Raz
چکیده

We show a connection between the deMorgan formula size of a Boolean function and the noise stability of the function. Using this connection, we show that the Fourier spectrum of any balanced Boolean function computed by a deMorgan formula of size s is concentrated on coefficients of degree up to O( √ s). These results have several applications that apply to any function f that can be computed by a deMorgan formula of size s. First, we get that f can be approximated (in L2-norm) with constant error by a polynomial of degree O( √ s). Second, we show an upper bound of O( √ s) on the average sensitivity of f . Our main result stems from a generalization of Khrapchenko’s bound [Khr71], that might be of independent interest, and some Fourier analysis on the Boolean cube. Previous works prove that any function f : {0, 1}n → {0, 1} that can be computed by a deMorgan formula of size s, can be approximated point-wise by a polynomial of degree O(s/2+o(1)) with constant point-wise error. We note that this result can be easily extended to have a polynomial of degree O(t ·s/2+o(1)) that approximates f with point-wise error 2−t, for any t > 0. This was shown in a long line of results in quantum complexity, including [BBC+01] and [FGG08, ACR+07, RS08, Rei09].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems

We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime p (the so called AC[p] Frege systems) to computational complexity lower bounds for search tasks involving search trees branching upon values of maps on the vector space of low degree polynomials over Fp. In 1988 Ajtai [2] proved th...

متن کامل

Algebraic Aspects of Fuzzy Sets and Fuzzy Logic

This paper is expository. It is mainly a survey of some of our work on the algebraic systems that arise in fuzzy set theory and logic. We include some of the proofs here and refer to the papers [18, 19, 20, 21, 22] for further details. Our point of view is the algebraic one: when are the various systems that arise isomorphic, and what are their symmetries (automorphisms)? The bulk of the materi...

متن کامل

A Characterization of Triple Semigroup of Ternary Functions and Demorgan Triple Semigroup of Ternary Functions

We define algebras of triple semigroup and DeMorgan triple semigroup and by defining three Mann’s compositions and one unary operation on the set of 3-place(ternary) functions over some set, we construct a DeMorgan triple semigroup of 3-place (ternary) functions and so find an abstract characterization of this algebras.

متن کامل

Amphotericin B is the wonder of today’s pharmacology science: persisting usage over seventh decades

Abstract: Despite several topical and systemic antifungal drugs are used for the treatment of fungal infection, Amphotericin B (AmB) is still one of the most common first-line choices in systemic fungal infection for over seventh decades from discovery. Amphotericin B which is belonged to the polyene group has a wide spectrum in vitro and in vivo antifungal activity. Its mechanism of antifunga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012